منابع مشابه
α-Visibility
We study a new class of visibility problems based on the notion of α-visibility. Given an angle α and a collection of line segments S in the plane, a segment t is said to be α-visible from a point p, if there exists an empty triangle with one vertex at p and the side opposite to p on t such that the angle at p is α. In this model of visibility, we study the classical variants of point visibilit...
متن کاملCone Visibility Decomposition Cone Visibility Decomposition Cone Visibility Decomposition Cone Visibility Decomposition Cone Visibility Decomposition Cone Visibility Decomposition
(a) (b) Figure 8: The nal set of directions from that covers G S in thick gray lines. Two views are provided with (a) presents the regular view of Figures 5 to 7 and (b) shows the entire Gauss map. See also Figure 1. (a) (b) Figure 6: The boundary and central silhouettes of G S in thick dark gray lines is projected onto the plane z = 1 in thick light gray lines, in (a). In (b), The convex hull ...
متن کاملTree-visibility Orders Tree-visibility Orders
In this paper we introduce a new class of partially ordered sets, called tree-visibility orders, extending the class of interval orders in a fashion similar to the extension of interval graphs to chordal graphs. This class contains interval orders, duals of generalized interval orders and height one orders. We give a characterization of tree-visibility orders by an innnite family of minimal for...
متن کاملVisibility Culling
One of the most important problems in computer graphics is the classification of all objects in a scene as either being at least partially visible or totally invisible. The issue of rapidly identifying entirely invisible objects is of importance in any rendering system, but it is especially crucial when interactive frame update rates are desired. In an ideal rendering system it would be possibl...
متن کاملWalking in the visibility complex with applications to visibility polygons and dynamic visibility
We first consider the set of faces of the complex representing rays issued from a given object. We define an order on these faces and show, once the visibility complex is computed, how to visit all of them with no additional data structure in optimal time O(kf ), where kf is the number of faces visited. Then we show how to use this walk to perform a topological sweep of the vertices incident to...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Geometry
سال: 2014
ISSN: 0925-7721
DOI: 10.1016/j.comgeo.2013.10.004